on the number of mutually disjoint cyclic designs
نویسندگان
چکیده
we denote by $ls[n](t,k,v)$ a large set of $t$-$(v,k,lambda)$ designs of size $n$, which is a partition of all $k$-subsets ofa $v$-set into $n$ disjoint $t$-$(v,k,lambda)$ designs and$n={v-t choose k-t}/lambda$. we use the notation$n(t,v,k,lambda)$ as the maximum possible number of mutuallydisjoint cyclic $t$-$(v,k,lambda)$designs. in this paper we givesome new bounds for $n(2,29,4,3)$ and $n(2,31,4,2)$. consequentlywe present new large sets $ls[9](2,4,29), ls[13](2,4,29)$ and$ls[7](2,4,31)$, where their existences were already known.
منابع مشابه
On the Number of Mutually Disjoint Cyclic Designs
We denote by LS[N ](t, k, v) a large set of t-(v, k, λ) designs of size N , which is a partition of all k-subsets of a v-set into N disjoint t-(v, k, λ) designs and N = ( v−t k−t ) /λ. We use the notation N(t, v, k, λ) as the maximum possible number of mutually disjoint cyclic t-(v, k, λ)designs. In this paper we give some new bounds for N(2, 29, 4, 3) and N(2, 31, 4, 2). Consequently we presen...
متن کاملOn the number of mutually disjoint pairs of S-permutation matrices
n 2 × n 2 permutation matrices containing a single 1 in each canonical n × n subsquare (block). The article suggests a formula for counting mutually disjoint pairs of n × n S-permutation matrices in the general case by restricting this task to the problem of finding some numerical characteristics of the elements of specially defined for this purpose factorset of the set of n× n binary matrices....
متن کاملOn the Number of Mutually Touching Cylinders
In a three-dimensional arrangement of 25 congruent nonoverlapping infinite circular cylinders there are always two that do not touch each other.
متن کاملMutually Disjoint Steiner Systems S(5, 8, 24) and 5-(24,12,48) Designs
We demonstrate that there are at least 50 mutually disjoint Steiner systems S(5, 8, 24) and there are at least 35 mutually disjoint 5-(24, 12, 48) designs. The latter result provides the existence of a simple 5-(24, 12, 6m) design for m = 24, 32, 40, 48, 56, 64, 72, 80, 112, 120, 128, 136, 144, 152, 160, 168, 200, 208, 216, 224, 232, 240, 248 and 256.
متن کاملMutually disjoint t-designs and t-SEEDs from extremal doubly-even self-dual codes
It is known that extremal doubly-even self-dual codes of length n ≡ 8 or 0 (mod 24) yield 3or 5-designs respectively. In this paper, by using the generator matrices of bordered double circulant doubly-even self-dual codes, we give 3-(n, k; m)-SEEDs with (n, k, m) ∈ {(32, 8, 5), (56, 12, 9), (56, 16, 9), (56, 24, 9), (80, 16, 52)}. With the aid of computer, we obtain 22 generator matrices of bor...
متن کاملsurvey on the rule of the due & hindering relying on the sheikh ansaris ideas
قاعده مقتضی و مانع در متون فقهی کم و بیش مستند احکام قرار گرفته و مورد مناقشه فقهاء و اصولیین می باشد و مشهور معتقند مقتضی و مانع، قاعده نیست بلکه یکی از مسائل ذیل استصحاب است لذا نگارنده بر آن شد تا پیرامون این قاعده پژوهش جامعی انجام دهد. به عقیده ما مقتضی دارای حیثیت مستقلی است و هر گاه می گوییم مقتضی احراز شد یعنی با ماهیت مستقل خودش محرز گشته و قطعا اقتضاء خود را خواهد داشت مانند نکاح که ...
15 صفحه اولمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
transactions on combinatoricsناشر: university of isfahan
ISSN 2251-8657
دوره 3
شماره 1 2014
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023